A Multiscale Nonhydrostatic Atmospheric Model Using Centroidal Voronoi Tesselations and C-Grid Staggering
نویسندگان
چکیده
منابع مشابه
A Multiscale Nonhydrostatic Atmospheric Model Using Centroidal Voronoi Tesselations and C-Grid Staggering
The formulation of a fully compressible nonhydrostatic atmospheric model called the Model for Prediction Across Scales–Atmosphere (MPAS-A) is described. The solver is discretized using centroidal Voronoi meshes and a C-grid staggering of the prognostic variables, and it incorporates a split-explicit time-integration technique used in many existing nonhydrostatic mesoand cloud-scale models. MPAS...
متن کاملGrid generation and optimization based on centroidal Voronoi tessellations
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions. Such tessellations are of use in very diverse applications, including data compression, clustering analysis, cell biology, territorial behavior of animals, and optimal allocation of resources. In this pape...
متن کاملSpherical Layout Implementation using Centroidal Voronoi Tessellations
The 3D tree visualization faces multiple challenges: the election of an appropriate layout, the use of the interactions that make the data exploration easier and a metaphor that helps in the process of information understanding. A good combination of these elements will result in a visualization that effectively conveys the key features of a complex structure or system to a wide range of users ...
متن کاملEdge-Weighted Centroidal Voronoi Tessellations
Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy — a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CV...
متن کاملFitting Voronoi Diagrams to Planar Tesselations
Given a tesselation of the plane, defined by a planar straightline graph G, we want to find a minimal set S of points in the plane, such that the Voronoi diagram associated with S ‘fits’ G. This is the Generalized Inverse Voronoi Problem (GIVP), defined in [12] and rediscovered recently in [3]. Here we give an algorithm that solves this problem with a number of points that is linear in the size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Weather Review
سال: 2012
ISSN: 0027-0644,1520-0493
DOI: 10.1175/mwr-d-11-00215.1